#include "bubbleSort.hpp"
#include "selectionSort.hpp"
#include "insertSort.hpp"
#include "shellSort.hpp"
#include "mergeSort.hpp"
#include "quickSort.hpp"

int main()
{
    int arr[] = {3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48};
    int n = sizeof(arr) / sizeof(int);
    quickSort(arr, 0, n - 1);
    std::cout << "quickSort" << std::endl;
    for (int i = 0; i < sizeof(arr) / sizeof(int); ++i)
    {
        std::cout << arr[i] << " ";
    }
    std::cout << std::endl;
    return 0;
}

